Refined Chung–Feller theorems for lattice paths

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Refined Chung-Feller theorems for lattice paths

In this paper we prove a strengthening of the classical Chung-Feller theorem and a weighted version for Schröder paths. Both results are proved by refined bijections which are developed from the study of Taylor expansions of generating functions. By the same technique, we establish variants of the bijections for Catalan paths of order d and certain families of Motzkin paths. Moreover, we obtain...

متن کامل

Parity Theorems for Statistics on Lattice Paths and Laguerre Configurations

We examine the parity of some statistics on lattice paths and Laguerre configurations, giving both algebraic and combinatorial treatments. For the former, we evaluate q-generating functions at q = −1; for the latter, we define appropriate parity-changing involutions on the associated structures. In addition, we furnish combinatorial proofs for a couple of related recurrences.

متن کامل

Counting Lattice Paths

Counting lattice paths Maciej Dziemiańczuk A lattice path is a finite sequence of points p0, p1, . . . , pn in Z × Z, and a step of the path is the difference between two of its consecutive points, i.e., pi−pi−1. In this thesis, we consider lattice paths running between two fixed points and for which the set of allowable steps contains the vertical step (0,−1) and some number (possibly infinite...

متن کامل

Lattice paths with catastrophes

In queuing theory, it is usual to have some models with a “reset” of the queue. In terms of lattice paths, it is like having the possibility of jumping from any altitude to zero. These objects have the interesting feature that they do not have the same intuitive probabilistic behaviour like classical Dyck paths (the typical properties of which are strongly related to Brownian motion theory), an...

متن کامل

Generalized Galois Numbers, Inversions, Lattice Paths, Ferrers Diagrams and Limit Theorems

Bliem and Kousidis recently considered a family of random variables whose distributions are given by the generalized Galois numbers (after normalization). We give probabilistic interpretations of these random variables, using inversions in random words, random lattice paths and random Ferrers diagrams, and use these to give new proofs of limit theorems as well as some further limit results.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 2005

ISSN: 0097-3165

DOI: 10.1016/j.jcta.2004.11.016